A NOTE ON NIELSEN TYPE NUMBERS

Estimating Nielsen Numbers on Infrasolvmanifolds

A well-known lower bound for the number of xed points of a self-map f : X ?! X is the Nielsen number N(f). Unfortunately, the Nielsen number is diicult to calculate. The Lefschetz number L(f), on the other hand, is readily computable, but does not give a lower bound for the number of xed points. In this paper, we investigate conditions on the space X which guarantee either N(f) = jL(f)j or N(f)...

Higher-order Nielsen Numbers

Suppose X , Y are manifolds, f ,g : X → Y are maps. The well-known coincidence problem studies the coincidence set C = {x : f (x) = g(x)}. The number m= dimX −dimY is called the codimension of the problem. More general is the preimage problem. For a map f : X → Z and a submanifold Y of Z, it studies the preimage set C = {x : f (x) ∈ Y}, and the codimension is m = dimX + dimY − dimZ. In case of ...

Estimating Nielsen Numbers on Wedge Product Spaces

A Nielsen theory for intersection numbers

Nielsen theory, originally developed as a homotopy-theoretic approach to fixed point theory, has been translated and extended to various other problems, such as the study of periodic points, coincidence points and roots. In this paper, the techniques of Nielsen theory are applied to the study of intersections of maps. A Nielsen-type number, the Nielsen intersection number NI(f, g), is introduce...

A Note on Nielsen Reduction and CosetEnumerationBirgit Reinert

Groups can be studied using methods from diierent elds such as combina-torial group theory or string rewriting. Recently techniques from Grr obner basis theory for free monoid rings (non-commutative polynomial rings) respectively free group rings have been added to the set of methods due to the fact that monoid and group presentations (in terms of string rewriting systems) can be linked to spec...